Fast NJ-like algorithms to deal with incomplete distance matrices
نویسندگان
چکیده
منابع مشابه
Fast algorithms for anti-distance matrices as a generalization of Boolean matrices
We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall’s algorithm for computing the transitive closure matrix of a graph from its adjacency matrix. Warshall’s algorithm can be generalized to Floyd’s algorithm for computing the distance matrix of a graph with weighted edges. We will generalize Boolean mat...
متن کاملFast algorithms for hierarchically semiseparable matrices
Semiseparable matrices and many other rank-structured matrices have been widely used in developing new fast matrix algorithms. In this paper, we generalize the hierarchically semiseparable (HSS) matrix representations and propose some fast algorithms for HSS matrices. We represent HSS matrices in terms of general binary HSS trees and use simplified postordering notation for HSS forms. Fast HSS ...
متن کاملFast Algorithms for Toeplitz and Hankel Matrices
The paper gives a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. It is written in the style of a textbook. Algorithms of Levinson-type and of Schur-type are discussed. Their connections with triangular factorizations, Padè recursions and Lanczos methods are demonstrated. In the case in which the matrices possess add...
متن کاملFast QR factorization of Cauchy-like matrices
n this paper we present two fast numerical methods for computing the QR factorization of a Cauchy-like matrix C with data points lying on the real axis or on the unit circle in the complex plane. It is shown that the rows of the Q-factor of C give the eigenvectors of a rank structured matrix partially determined by some prescribed spectral data. This property establishes a basic connection betw...
متن کاملSpectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we provide a simple and very efficient convex algorithm for minimizing the reconstruction error subject to a bound on the nuclear norm. Our algorithm Soft-Impute iteratively replaces the missing elements with those obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2008
ISSN: 1471-2105
DOI: 10.1186/1471-2105-9-166